Improved Mesh Generation: Not Simple but Good
نویسندگان
چکیده
An improved algorithm for two-dimensional triangular mesh generation in arbitrary polygonally bounded domains with holes and isolated interior points is presented. The algorithm is quad-tree based and follows the ideas of Bern, Eppstein and Gilbert 1]. Using a rhomboid structure of the quad-tree and a number of new ideas for warping and centering points and for shifting grids, we are able to generate meshes with provably good angle bounds between 30 and 90 (except probably smaller angles of the polygonal boundary given as input).
منابع مشابه
Quadtree and Octree Grid Generation
Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملJoint Link/packet Scheduling, Rate Allocation and Routing Optimization in Stdma Based Wireless Mesh Networks
JOINT LINK/PACKET SCHEDULING, RATE ALLOCATION AND ROUTING OPTIMIZATION IN STDMA BASED WIRELESS MESH NETWORKS Ahmet Emrah SEZGİN M.S. in Electrical and Electronics Engineering Supervisor: Assoc. Prof. Dr. Ezhan KARAŞAN August 2009 Wireless Mesh Networks (WMN) are a promising solution for next generation wireless access networks since they cherish benefits of having a reliable backbone in an ad h...
متن کاملHULK - Simple and fast generation of structured hexahedral meshes for improved subsurface simulations
Short for Hexahedra from Unique Location in (K)convex Polyhedra – HULK is a simple and efficient algorithm to generate hexahedral meshes from generic STL files describing a geological model to be used in simulation tools based on the finite difference, finite volume or finite element methods. Using binary space partitioning of the input geometry and octree refinement on the grid, a successive i...
متن کاملConstrained Delaunay Tetrahedralizations and Provably Good Boundary Recovery
In two dimensions, a constrained Delaunay triangulation (CDT) respects a set of segments that constrain the edges of the triangulation, while still maintaining most of the favorable properties of ordinary Delaunay triangulations (such as maximizing the minimum angle). CDTs solve the problem of enforcing boundary conformity—ensuring that triangulation edges cover the boundaries (both interior an...
متن کامل